package com.lzq.leetcode.hoot100;

public class s152 {

    public int maxProduct(int[] nums) {
        return 1;
    }

    private int maxAbs(int a, int b) {
        return Math.abs(a) > Math.abs(b) ? a : b;
    }

    public static void main(String[] args) {
        s152 s152 = new s152();
        System.out.println(s152.maxProduct(new int[]{2, 3, -2, 4}));
    }
}
